Bist Reseeding with very few Seeds
نویسندگان
چکیده
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of deterministic seeds required is directly proportional to the tester storage or hardware overhead requirement. In this paper, we present an algorithm for seed ordering to minimize the number of seeds required to cover a set of deterministic test patterns. Our technique is applicable whether seeds are loaded from the tester or encoded on chip. Simulations show that, when compared to random ordering, the technique reduces seed storage or hardware overhead by up to 80%. The seeds we use are deterministic so 100% SSF fault coverage can be achieved. Also, the technique we present is fault-model independent.
منابع مشابه
An E cient BIST Scheme Based on Reseeding of Multiple Polynomial Linear Feedback Shift Registers
In this paper we describe an optimized BIST scheme based on reseeding of multiple polynomial Linear Feedback Shift Registers LFSRs The same LFSR that is used to gen erate pseudo random patterns is loaded with seeds from which it produces vectors that cover the testcubes of dif cult to test faults The scheme is compatible with scan design and achieves full coverage as it is based on random patte...
متن کاملBuilt-In Reseeding for Serial Bist
Reseeding is used to improve fault coverage in pseudo-random testing. Most of the work done on reseeding is based on storing the seeds in an external tester. Besides its high cost, testing using automatic test equipment (ATE) makes it hard to test the circuit while in the system. In this paper, we present a technique for built-in reseeding. Our technique requires no storage for the seeds. The s...
متن کاملA mixed mode BIST scheme based on reseeding of folding counters
In this paper a new scheme for deterministic and mixed mode scan-based BIST is presented. It relies on a new type of test pattern generator which resembles a programmable Johnson counter and is called folding counter. Both the theoretical background and practical algorithms are presented to characterize a set of deterministic test cubes by a reasonably small number of seeds for a folding counte...
متن کاملBIST Scheme Based on Reseeding ofMultiple Polynomial Linear Feedback Shift
In this paper we describe an optimized BIST scheme based on reseeding of multiple polynomial Linear Feedback Shift Registers (LFSRs). The same LFSR that is used to generate pseudo-random patterns, is loaded with seeds from which it produces vectors that cover the testcubes of dif-cult to test faults. The scheme is compatible with scan-design and achieves full coverage as it is based on random p...
متن کاملLow-overhead Built-in Bist Reseeding
Reseeding is used to improve fault coverage in pseudo-random testing. Most of the work done on reseeding is based on storing the seeds in an external tester. Besides its high cost, testing using automatic test equipments (ATEs) makes it hard to test the circuit while in the system. In this paper, we present a technique for built-in reseeding. Our technique requires no storage for the seeds. The...
متن کامل